Simple vertices of maximal minor polytopes
نویسندگان
چکیده
منابع مشابه
Maximal Number of Vertices of Polytopes Defined by F-Probabilities
Every F-probability (= coherent probability) F on a finite sample space Ωk with k elements defines a set of classical probabilities in accordance with the interval limits. This set, called “structure” of F , is a convex polytope having dimension ≤ k−1. We prove that the maximal number of vertices of structures is exactly k!.
متن کاملVertices of Gelfand-Tsetlin Polytopes
This paper is a study of the polyhedral geometry of Gelfand–Tsetlin polytopes arising in the representation theory of glnC and algebraic combinatorics. We present a combinatorial characterization of the vertices and a method to calculate the dimension of the lowest-dimensional face containing a given Gelfand–Tsetlin pattern. As an application, we disprove a conjecture of Berenstein and Kirillov...
متن کاملCounting vertices in Gelfand-Zetlin polytopes
Article history: Received 20 June 2012 Available online 13 February 2013
متن کاملComplementary Vertices and Adjacency Testing in Polytopes
Our main theoretical result is that, if a simple polytope has a pair of complementary vertices (i.e., two vertices with no facets in common), then it has a second such pair. Using this result, we improve adjacency testing for vertices in both simple and non-simple polytopes: given a polytope in the standard form {x ∈ R |Ax = b and x ≥ 0} and a list of its V vertices, we describe an O(n) test to...
متن کاملCounting d-Polytopes with d+3 Vertices
We completely solve the problem of enumerating combinatorially inequivalent d-dimensional polytopes with d + 3 vertices. A first solution of this problem, by Lloyd, was published in 1970. But the obtained counting formula was not correct, as pointed out in the new edition of Grünbaum’s book. We both correct the mistake of Lloyd and propose a more detailed and self-contained solution, relying on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 1994
ISSN: 0179-5376,1432-0444
DOI: 10.1007/bf02574010